94. Binary Tree Inorder Traversal.go

package leetcode

import (
"github.com/halfrost/LeetCode-Go/structures"
)

// TreeNode define
typeTreeNode= structures.TreeNode

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 * Val int
 * Left *TreeNode
 * Right *TreeNode
 * }
 */

funcinorderTraversal(root*TreeNode) []int {
varresult []int
inorder(root, &result)
returnresult
}

funcinorder(root*TreeNode, output*[]int) {
ifroot!=nil {
inorder(root.Left, output)
*output=append(*output, root.Val)
inorder(root.Right, output)
 }
}